翻訳と辞書 Words near each other ・ Universal Music Polska ・ Universal Music Publishing Group ・ Universal Music TV ・ Universal Nation ・ Universal National Service Act ・ Universal Natural History and Theory of Heaven ・ Universal Negro Improvement Association and African Communities League ・ Universal neonatal hearing screening ・ Universal Network Device Interface ・ Universal Network Objects ・ Universal Networking Language ・ Universal Newsreel ・ Universal Numbering System ・ Universal Nut Sheller ・ Universal of National Unity ・ Universal one-way hash function ・ Universal opportunity ・ Universal Order of Armageddon ・ Universal Orlando ・ Universal Pantheist Society ・ Universal parabolic constant ・ Universal Parks & Resorts ・ Universal Party (South Africa) ・ Universal Payment Identification Code ・ Universal Peace Foundation ・ Universal Periodic Review ・ Universal Periodic Review of New Zealand ・ Universal Persian ・ Universal Persian Alphabet ・ Universal Personal Telecommunications Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Universal one-way hash function ： ウィキペディア英語版 Universal one-way hash function In cryptography a universal one-way hash function (UOWHF, often pronounced "woof"), is a type of universal hash function of particular importance to cryptography. UOWHF's are proposed as an alternative to collision-resistant hash functions (CRHFs). CRHFs have a strong collision-resistance property: that it is hard, given randomly chosen hash function parameters, to find any collision of the hash function. In contrast, UOWHFs require that it be hard to find a collision where one preimage is chosen independently of the hash function parameters. The primitive was suggested by Moni Naor and Moti Yung and is also known as "target collision resistant" hash functions; it was employed to construct general digital signature schemes without trapdoor functions, and also within chosen-ciphertext secure public key encryption schemes. The UOWHF family contains a finite number of hash functions with each having the same probability of being used. ==Definition== The security property of a UOWHF is as follows. Let $A$ be an algorithm that operates in two phases: * Initially, $A$ receives no input (or, just a security parameter) and chooses a value $x$. * A hash function $H$ is chosen randomly from the family. $A$ then receives $H$ and must output $y\; \backslash ne\; x$ such that $H(x)\; =\; H(y)$. Then for all polynomial-time $A$ the probability that $A$ succeeds is negligible. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Universal one-way hash function」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.